#include "BinarySearchTree.h"

int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> bs;
	for (auto e : a)
	{
		bs.Insert(e);
	}
	bs.InOrder();
	BSTree<int> copy(bs);
	copy.InOrder();

	BSTree<int> copy2;
	copy2 = bs;
	copy2.InOrder();

	bs.Erase(14);
	bs.InOrder();

	bs.Erase(3);
	bs.InOrder();

	bs.Erase(8);
	bs.InOrder();

	for (auto e : a)
	{
		bs.Erase(e);
		bs.InOrder();
	}


	return 0;
}